Description: jcreator下写的背包问题,适合JAVA入门。给定背包的容量,在输入的物品中,求出符合条件的解,如果不存在解,则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the output does not exist Platform: |
Size: 2048 |
Author:小文 |
Hits:
Description: 背包问题,用遗传算法解决,并在VC++环境下调试通过,得到正确结果,可供参考,源码C文件中有较详细的注释-Knapsack problem, using genetic algorithm, and in the VC++ debugging environment through, get the correct results, for reference, source C files in more detailed comments Platform: |
Size: 12288 |
Author:paradise |
Hits:
Description: 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program Platform: |
Size: 778240 |
Author:hudongfang |
Hits:
Description: 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为:给定一组物品,每种物品都有自己的重量和价格,在限定的总重量内,我们如何选择,才能使得物品的总价格最高。用2种方法实现背包问题,用C语言编写,数据结构课内试验-Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a set of items, each item has its own weight and price, the total weight limit, we choose, to make up the total price of items. 2 methods used to achieve knapsack problem, using C language, data structure testing curricular Platform: |
Size: 1026048 |
Author:linfuhong |
Hits:
Description: 01背包是在M件物品取出若干件放在空间为W的背包里,每件物品的体积为W1,W2……Wn,与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn, corresponding to the value of P1, P2 ... ... Pn. Find the maximum value of the program. In this case, all values are integers Platform: |
Size: 136192 |
Author:阿四 |
Hits:
Description: 使用c++实现了0-1背包问题的算法,根据要求找出最佳的选项放入背包-Using c++ implementation of the 0-1 knapsack problem algorithms required to find the best option backpack Platform: |
Size: 1024 |
Author:rucy |
Hits:
Description: 原创,背包问题的四种解法,回溯法,动态规划法,以及两种蛮力法,C++代码,编译运行通过,结果正确,可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare the efficiency of the method. Platform: |
Size: 2451456 |
Author:ZLS |
Hits:
Description: 这是一个关于0-1背包问题算法的编程实现,包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm Platform: |
Size: 2156544 |
Author:哈达 |
Hits:
Description: 本文档详细分析了动态规划的经典模型-背包问题,能够有效强化对该类型算法的理解。-This document is a detailed analysis of the classic model of the dynamic programming- knapsack problem, can effectively enhance the understanding of this type of algorithm. Platform: |
Size: 31744 |
Author: |
Hits:
Description: 关于matlab解决0-1背包问题的修改,原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code Platform: |
Size: 16384 |
Author:鲍文正 |
Hits:
Description: 详细讲解背包问题,背包问题(Knapsack problem)是一种组合优化的NP完全问题。-Explain in detail the knapsack problem, the knapsack problem (Knapsack problem) is a combinatorial optimization NP-complete problem. Platform: |
Size: 29696 |
Author:longqiang |
Hits: